Reduction from non-injective hidden shift problem to injective hidden shift problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reduction from non-injective hidden shift problem to injective hidden shift problem

We introduce a simple tool that can be used to reduce non-injective instances of the hidden shift problem over arbitrary group to injective instances over the same group. In particular, we show that the average-case non-injective hidden shift problem admit this reduction. We show similar results for (non-injective) hidden shift problem for bent functions. We generalize the notion of influence a...

متن کامل

Easy and Hard Functions for the Boolean Hidden Shift Problem

We study the quantum query complexity of the Boolean hidden shift problem. Given oracle access to f(x + s) for a known Boolean function f , the task is to determine the n-bit string s. The quantum query complexity of this problem depends strongly on f . We demonstrate that the easiest instances of this problem correspond to bent functions, in the sense that an exact onequery algorithm exists if...

متن کامل

Quantum Algorithm for the Boolean Hidden Shift Problem

The hidden shift problem is a natural place to look for new separations between classical and quantum models of computation. One advantage of this problem is its flexibility, since it can be defined for a whole range of functions and a whole range of underlying groups. In a way, this distinguishes it from the hidden subgroup problem where more stringent requirements about the existence of a per...

متن کامل

Injective and non-injective realizations with symmetry

In this paper, we introduce a natural classification of bar and joint frameworks that possess symmetry. This classification establishes the mathematical foundation for extending a variety of results in rigidity, as well as infinitesimal or static rigidity, to frameworks that are realized with certain symmetries and whose joints may or may not be embedded injectively in the space. In particular,...

متن کامل

The Word Problem for 3-manifolds Built from Injective Handlebodies

This paper gives a proof that the fundamental group a class of closed orientable 3-manifolds constructed from three injective handlebodies has a solvable word problem. This is done by giving an algorithm, that terminates in bounded time, to decide if a closed curve in the manifold is null-homotopic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information and Computation

سال: 2013

ISSN: 1533-7146,1533-7146

DOI: 10.26421/qic13.3-4-4